Logic programming: Laxness and saturation

Logic programming: laxness and saturation

A propositional logic program P may be identified with a PfPf -coalgebra on the set of atomic propositions in the program. The corresponding C(PfPf )coalgebra, where C(PfPf ) is the cofree comonad on PfPf , describes derivations by resolution. That correspondence has been developed to model first-order programs in two ways, with lax semantics and saturated semantics, based on locally ordered ca...

Category Theoretic Semantics for Theorem Proving in Logic Programming: Embracing the Laxness

A propositional logic program P may be identified with a PfPf -coalgebra on the set of atomic propositions in the program. The corresponding C(PfPf )-coalgebra, where C(PfPf ) is the cofree comonad on PfPf , describes derivations by resolution. Using lax semantics, that correspondence may be extended to a class of first-order logic programs without existential variables. The resulting extension...

Programming by Logic and Logic by Programming

This paper is an extended abstract of parts I and II of a monograph with the same title being prepared by the authors. Logic was developed before the arrival of computers and it can be presented without reference to them. The main idea of the monograph is to stress the mutual links between logic and computer programming by taking those parts of logic which deal with computability and nitary log...

Multi-paradigm Logic Programming Compositional Logic Programming

Programming with Logic without Logic Programming

We extend a logic-based agent and production system language, LPS, from the single agent to the multi-agent case in which agents coordinate their behaviour through the medium of a shared state, which is viewed as a model-theoretic structure. In the extended language MALPS, each agent can be viewed as a collection of reactive rules: conditions  conclusions, which have both a procedural and a de...